The Uniqueness of Stable Matchings
نویسنده
چکیده
This paper analyses conditions on agents’ preferences for a unique stable matching in models of two-sided matching with non-transferable utility. The No Crossing Condition (NCC) is sufficient for uniqueness; it is based on the notion that a person’s characteristics, for example their personal qualities or their productive capabilities, not only form the basis of their own attraction to the opposite sex but also determine their own preferences. The paper also shows that a weaker condition, alpha-reducibility, is both necessary and sufficient for a population and any of its subpopulations to have a unique stable matching. If preferences are based on utility functions with agents’ characteristics as arguments, then the NCC may be easy to verify. The paper explores conditions on utility functions which imply that the NCC is satisfied whatever the distribution of characteristics. The usefulness of this approach is illustrated by two simple models of household formation.
منابع مشابه
On the uniqueness of stable marriage matchings
A sufficient condition for uniqueness is identified on the preferences in the marriage problem, i.e. two-sided one-to-one matching with non transferable utility. For small economies this condition is also necessary. This class of preferences is broad and they are of particular relevance in economic applications. 2000 Elsevier Science S.A. All rights reserved.
متن کاملA note on the uniqueness of stable marriage matching
In this note we present some sufficient conditions for the uniqueness of a stable matching in the Gale-Shapley marriage classical model of even size. We also state the result on the existence of exactly two stable matchings in the marriage problem of odd size with the same conditions.
متن کاملUnconditionally Stable Difference Scheme for the Numerical Solution of Nonlinear Rosenau-KdV Equation
In this paper we investigate a nonlinear evolution model described by the Rosenau-KdV equation. We propose a three-level average implicit finite difference scheme for its numerical solutions and prove that this scheme is stable and convergent in the order of O(τ2 + h2). Furthermore we show the existence and uniqueness of numerical solutions. Comparing the numerical results with other methods in...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملExploring Strategy-Proofness, Uniqueness, and Pareto Optimality for the Stable Matching Problem with Couples
The Stable Matching Problem with Couples (SMP-C) is a ubiquitous real-world extension of the stable matching problem (SMP) involving complementarities. Although SMP can be solved in polynomial time, SMP-C is NP-Complete. Hence, it is not clear which, if any, of the theoretical results surrounding the canonical SMP problem apply in this setting. In this paper, we use a recently-developed SAT enc...
متن کاملThe Class of Stable Matchings for Computational Stereo
In this paper the notion of stability of a bipartite matching is introduced and studied. It is a strong but overlooked constraint very useful in computational stereo. The resulting algorithms require no prior continuity model, are parameter-free, very fast, and accurate in terms of mismatches. A whole class of stable matchings is presented. It is shown that some of the popular matching algorith...
متن کامل